Weak Congruence Representability of Suborders and Direct Products

نویسنده

  • Vanja Stepanović
چکیده

Here we treat the problem of representability of an algebraic lattice by the weak congruence lattice of an algebra, i.e. the lattice of all symmetric and transitive relations compatible with algebra. We prove that some suborders of the representable lattices are representable, and give conditions under which these suborders are also sublattices of the initial lattices. We also prove that the direct product of a set of representable lattices, slightly extended, is representable itself.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Weak Congruence Representability of Sublattices and Suborders of Representable Lattices

In this paper we introduce a new direction in the investigations of the open problem of the representation of algebraic lattices by the weak congruence lattices. In some cases the representability of some lattice follows from the representability of another lattice. We give some results. AMS Mathematics Subject Classification (2010): 08A30

متن کامل

Weak Relational Products

The existence of relational products in categories of relations is strongly connected with the representability of that category. In this paper we propose a canonical weakening of the notion of a relational product. Unlike the strong version any (small) category of relations can be embedded into a suitable category providing all weak relational products. Furthermore, we investigate the categori...

متن کامل

Implicit Leadership Theories (ILTs) and change behaviors: the mediating role of LMX

Capitalizing upon Implicit Leadership Theories (ILTs) and Leader-member exchange (LMX), this research aims to explore the relationship between the congruence of employees’ ILTs and those traits of their managers and employees’ supportiveness, resistance and behavioral creativity for change. After distributing three questionnaires at three points among teachers, 296 participants completed all th...

متن کامل

Axiomatizing Prefix Iteration with Silent Steps

Prefix iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the first argument to be an atomic action. The interaction of prefix iteration with silent steps is studied in the setting of Milner’s basic CCS. Complete equational axiomatizations are given for four notions of behavioural congruence over basic CCS with prefix iteration, viz...

متن کامل

Solving System of Linear Congruence Equations over some Rings by Decompositions of Modules

In this paper, we deal with solving systems of linear congruences over commutative CF-rings. More precisely, let R be a CF-ring (every finitely generated direct sum of cyclic R-modules has a canonical form) and let I_1,..., I_n be n ideals of R. We introduce congruence matrices theory techniques and exploit its application to solve the above system. Further, we investigate the application of co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012